CMSC 451 Dave Mount CMSC 451 : Lecture 17 Extensions of Network Flow Thursday , Nov 9 , 2017

CMSC 451 : Lecture 17 Network Flow : Extensions Thursday , Nov 9 , 2017

Extensions of Network Flow: Network flow is an important problem because it is useful in a wide variety of applications. We will discuss two useful extensions to the network flow problem. We will show that these problems can be reduced to network flow, and thus a single algorithm can be used to solve both of them. Many computational problems that would seem to have little to do with flow of flu...

CMSC 451 Dave Mount CMSC 451 : Lecture 19 NP - Completeness : Reductions Tue , Nov 21 , 2017

CMSC 451 Dave Mount CMSC 451 : Lecture 10 Dynamic Programming : Weighted Interval Scheduling

Dynamic Programming: In this lecture we begin our coverage of an important algorithm design technique, called dynamic programming (or DP for short). The technique is among the most powerful for designing algorithms for optimization problems. Dynamic programming is a powerful technique for solving optimization problems that have certain well-defined clean structural properties. (The meaning of t...

CMSC 451 Dave Mount CMSC 451 : Lecture 12

Chain matrix multiplication: This problem involves the question of determining the optimal sequence for performing a series of operations. This general class of problem is important in compiler design for code optimization and in databases for query optimization. We will study the problem in a very restricted instance, where the dynamic programming issues are easiest to see. Suppose that we wis...

CMSC 451 : Lecture 21 Clique , Vertex Cover , and Dominating Set Thursday , Nov 30 , 2017

Vertex Cover (VC): A vertex cover in an undirected graph G = (V,E) is a subset of vertices V ′ ⊆ V such that every edge in G has at least one endpoint in V ′. The vertex cover problem (VC) is: given an undirected graph G and an integer k, does G have a vertex cover of size k? Dominating Set (DS): A dominating set in a graph G = (V,E) is a subset of vertices V ′ such that every vertex in the gra...